Fast Image Domain Fractal Compression by DCT Domain Block Matching
نویسنده
چکیده
Fractal image compression entails a computationally costly search for matching image blocks. It is proposed that a block be represented by its DCT coefficients, which may be made invariant to many of the usual block transforms. Due to the energy packing properties of the DCT, the efficiency of an existing multidimensional nearest neighbour search is improved.
منابع مشابه
Fast Fractal Encoding in Frequency Domain
Fractal image compression applies the self-similarity property of image. Many researches have been done to study the properties of fractal coding in image domain. In this paper, however, we try to explore the features of fractal coding in frequency domain. We rstly overview the properties of fractal coding in image domain, then we derive the corresponding formula of scaling factor and o set of ...
متن کاملA fast encoding algorithm for fractal image compression using the DCT inner product
In this paper, a fast encoding algorithm is developed for fractal image compression. At each search entry in the domain pool, the mean square error (MSE) calculations of the given range block and the eight dihedral symmetries of the domain block are obtained simultaneously in the frequency domain, in which the redundant computations are all eliminated in the new encoding algorithm. It is shown ...
متن کاملMulti-Focus Image Fusion in DCT Domain using Variance and Energy of Laplacian and Correlation Coefficient for Visual Sensor Networks
The purpose of multi-focus image fusion is gathering the essential information and the focused parts from the input multi-focus images into a single image. These multi-focus images are captured with different depths of focus of cameras. A lot of multi-focus image fusion techniques have been introduced using considering the focus measurement in the spatial domain. However, the multi-focus image ...
متن کاملLocal Search Fractal Image Compression for Fast Integrated Implementation
| The well known drawback of fractal image coding is its heavy computation complexity. In this paper, we show however that only a very small portion of this complexity is needed to encode the contours and the smooth areas of the objects of a certain minimum size. This is simply achieved by a local search of the matching domain blocks without isometry. Therefore, instead of forcing the fractal c...
متن کاملRegion-Based Image Compression Using Fractals and Shape-Adaptive DCT
reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. ABSTRACT The signiicant eeort to provide region-based compression and functionality within the MPEG-4 standard is not paralleled in the stil...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995